A Fast Normalized Cross Correlation-Based Block Matching Algorithm Using Multilevel Cauchy-Schwartz Inequality
نویسنده
چکیده
© 2011 Byung Cheol Song 401 This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reduction is achieved re-using the normalized cross correlation values for the spatially neighboring macroblock because the search areas of adjacent macroblocks are overlapped. Simulation results show that the proposed algorithm can improve the speed-up ratio up to about 3 times in comparison with the existing algorithm.
منابع مشابه
Fast Block Matching with Normalized Cross-Correlation using Walsh Transforms
Local image matching (block-matching) is a frequent operation in many image processing tasks, such as MPEG compression and the estimation of optical flow and stereo disparities. Normalized cross-correlation (NCC) is particularly useful since it is insensitive to both signal strength and level. However, NCC is computationally expensive. In this article we attempt to speed up NCC first by transfo...
متن کاملFast Template Matching
Although it is well known that cross correlation can be efficiently implemented in the transform domain, the normalized form of cross correlation preferred for template matching applications does not have a simple frequency domain expression. Normalized cross correlation is usually computed in the spatial domain for this reason. This short paper shows that unnormalized cross correlation can be ...
متن کاملTemplate Matching using Fast Normalized Cross Correlation
In this paper we present an algorithm for fast calculation of the normalized cross correlation NCC and its applica tion to the problem of template matching Given a template t whose position is to be determined in an image f the basic idea of the algorithm is to represent the template for which the normalized cross correlation is calculated as a sum of rectangular basis functions Then the correl...
متن کاملSimple low-dimensional features approximating NCC-based image matching
This paper proposes new low-dimensional image features that enable images to be very efficiently matched. Image matching is one of the key technologies for many vision-based applications, including template matching, block motion estimation, video compression, stereo vision, image/video near-duplicate detection, similarity join for image/video database, and so on. Normalized cross correlation (...
متن کاملKalman/Map Filtering-Aided Fast Normalized Cross Correlation-Based Wi-Fi Fingerprinting Location Sensing
A Kalman/map filtering (KMF)-aided fast normalized cross correlation (FNCC)-based Wi-Fi fingerprinting location sensing system is proposed in this paper. Compared with conventional neighbor selection algorithms that calculate localization results with received signal strength (RSS) mean samples, the proposed FNCC algorithm makes use of all the on-line RSS samples and reference point RSS variati...
متن کامل